theory n. 1.理論,學(xué)理,原理。 2.學(xué)說(shuō),論說(shuō) (opp. hypothesis)。 3.推測(cè),揣度。 4.〔口語(yǔ)〕見(jiàn)解,意見(jiàn)。 the theory of two points 兩點(diǎn)論。 Darwin's theory of evolution 達(dá)爾文的進(jìn)化論。 theory of equations 【數(shù)學(xué)】方程論。 theory of everything 【物理學(xué)】(把相對(duì)論、量子論和宇宙大爆炸理論都包括在內(nèi)的)萬(wàn)用理論。 theory of relativity 【物理學(xué)】相對(duì)論。 the atomic theory 原子說(shuō)。 Our scheme is good both in theory and in practice. 我們的方案在理論上和實(shí)施上都是好的。 combine [separate] theory with [from] practice 理論結(jié)合[脫離]實(shí)際。 My theory is that we must bring new blood into the Institute through appointment of younger men to important positions. 我的意見(jiàn)是我們學(xué)院應(yīng)該通過(guò)重用年輕一些的人來(lái)注入新的血液。 theory of games 博弈論,對(duì)策論,權(quán)衡利弊得失的形勢(shì)分析。
With the use of computability theory dividing whole - word coding into two parts : writing - input coding and computational coding , an method of none keyboard mapping for spelling language is proposed 本文依據(jù)可計(jì)算性理論,提出了拼音文字非鍵盤(pán)映射編碼方法,將整詞編碼分為輸寫(xiě)碼與計(jì)算碼。
The thesis consists of four sections . in section one , we introduce some background of the topic , in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees , in section three , we outline the basic principles of the priority tree argument , one of the main frameworks and tools of theorem proving in computability theory , and in section four , we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a , b such that a , b ? pc , and the join a v b of a and b is high 本篇論文分為4個(gè)部分:第一部分介紹了這個(gè)領(lǐng)域的一些背景知識(shí);第二部分主要回顧了前人在研究可計(jì)算枚舉度的結(jié)構(gòu)和層譜時(shí)所取得的一些基本和最新結(jié)果,這些結(jié)果與我們的主題?加杯圖靈度的代數(shù)結(jié)構(gòu)密切相關(guān);在第三部分中,我們概要的描述了優(yōu)先樹(shù)方法的基本原理,此方法是可計(jì)算性理論中定理證明的一個(gè)重要框架和工具;第四部分證明了一個(gè)加杯圖靈度代數(shù)結(jié)構(gòu)的新結(jié)果:存在兩個(gè)可計(jì)算枚舉度a , b ,滿(mǎn)足a , b pc ,而且a和b的并a b是一個(gè)高度。
百科解釋
Computability theory, also called recursion theory, is a branch of mathematical logic, of computer science, and of the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since grown to include the study of generalized computability and definability.